Transfomation of Non-feasible Inverse Maximum Flow Problem into a Feasible one by Flow Modification
نویسندگان
چکیده
A linear time method to decide if any inverse maximum flow (denoted IMFG) problem has solution is presented. For the case of IMFG not being feasible, a new inverse combinatorial optimization problem is introduced and solved. The problem is to modify as little as possible the flow so that the problem becomes feasible for the modified flow. Key–Words: inverse combinatorial optimization, maximum flow.
منابع مشابه
Inverse Maximum Dynamic Flow Problem under the Sum-Type Weighted Hamming Distance
Inverse maximum flow (IMDF), is among the most important problems in the field ofdynamic network flow, which has been considered the Euclidean norms measure in previousresearches. However, recent studies have mainly focused on the inverse problems under theHamming distance measure due to their practical and important applications. In this paper,we studies a general approach for handling the inv...
متن کاملCapacity Inverse Minimum Cost Flow Problem under the Weighted Hamming Distances
Given an instance of the minimum cost flow problem, a version of the corresponding inverse problem, called the capacity inverse problem, is to modify the upper and lower bounds on arc flows as little as possible so that a given feasible flow becomes optimal to the modified minimum cost flow problem. The modifications can be measured by different distances. In this article, we consider the capac...
متن کاملTHE INVERSE MAXIMUM FLOW PROBLEM UNDER WEIGHTED lk NORM
The problem consists in modifying the lower and the upper bounds of a given feasible flow f in a network G so that the given flow becomes a maximum flow in G and the distance between the initial vector of bounds and the modified one measured using weighted Lk norm (k ∈ N) is minimum. We denote this problem by IMFWLk. IMFWLk is a generalization of the inverse maximum flow problem under Lk norm (...
متن کاملA Branch and Bound Method for Finding Flow Path Designing of Agv Systems (RESEARCH NOTE)
One of the important factor in the design of automated guided vehicle systems (AGVS) is the flow path design. This paper presents a branch-and-bound algorithm to determining the flow path by considering not only loaded-vehicles, but also empty-vehicles. The objective is to find the flow path, which will minimize total travel of loaded vehicles. We know that in branch-and-bound method a branch c...
متن کاملTHE INVERSE MAXIMUM FLOW PROBLEM UNDER WEIGHTED l∞ NORM
The problem introduced in this paper (denoted IMFW∞) is to modify the capacities on arcs from a network so that a given feasible flow becomes a maximum flow and the maximum cost of change of the capacities is minimum. This problem is a generalization of the inverse maximum flow problem under l∞ norm (denoted IMF∞, where the per unit cost of modification is equal to 1 on all arcs), which was pri...
متن کامل